Communication Complexity Of Approximate Nash Equilibria - Aviad Rubinstein

Communication complexity of approximate Nash equilibria - Aviad Rubinstein

Institute for Advanced Study

Communication complexity of Nash equilibrium in potential games

IEEE FOCS: Foundations of Computer Science

Settling the complexity of computing approximate two-player Nash equilibria - Nash equilibria

Institute for Advanced Study

Aviad Rubinstein (Stanford University) Approximate maximum matching, SETH, obfuscation, and you

Smoothed Complexity of 2-player Nash Equilibria

IEEE FOCS: Foundations of Computer Science

Settling the complexity of computing approximate 2-player Nash equilibria

Nash Equilibrium in 5 Minutes

Aviad Rubinstein: Distributed PCP theorems for hardness of approximation in P

Computational Complexity

2.2.B: Near-optimal Communication Lower Bounds for Approximate Nash Equilibria

FOCS Conference

ETH Hardness for Densest-k-Subgraph with Perfect Completeness

Simons Institute

Dynamics and Equilibria: Communication Complexity and Adaptive Heuristics [1/8]

Microsoft Research

Hardness of Approximation Between P and NP

Google TechTalks

Communication Complexity I

Simons Institute

Yakov Babichenko: Settling the complexity of Nash equilibrium in congestion games

Israeli Algorithmic Game Theory Seminar

Aviad Rubinstein: Beyond-X: Toward more general Prophet Inequalities and Secretary Problems

YoungEC 2017 Workshop

5.1. Communication Complexity: Introduction

Complexity of Nash: PPAD (AGT 16)

Professor Bryce

Pranjal Awasthi: On Nash Equilibria of Approximation-Stable Games

Stanford Computer Science Theory

Tim Roughgarden - Communication Complexity and Impossibility Results for Simple Auctions

Israel Institute for Advanced Studies

02 - Cheng - Well-Supported versus Approximate Nash Equilibria (missing beginning)

ITCS Conference